package com.wc.acwing.二分.最大限度地提高生产力;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * @Author congge
 * @Date 2025/3/13 22:24
 * @description
 * https://www.acwing.com/problem/content/5543/
 */
public class Main {
    /**
     * 思路：
     * c[i] > t[i] + s, 说明可以访问到
     * a[i] > b[i] + x, x < a[i] - b[i]
     * x <= a[i] - b[i] - 1;
     * 当 x <= a[i] - b[i] - 1的时候, 该农场会被访问
     * 那就找到前面满足的， 也就是倒叙排序
     */
    static FastReader sc = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 200010;
    static int[] a = new int[N], b = new int[N];
    static int n, m;

    public static void main(String[] args) {
        n = sc.nextInt();
        m = sc.nextInt();
        for (int i = 1; i <= n; i++) a[i] = sc.nextInt();
        for (int i = 1; i <= n; i++) b[i] = sc.nextInt();
        for (int i = 1; i <= n; i++) a[i] = a[i] - b[i] - 1;
        Arrays.sort(a, 1, n + 1);;
        for (int i = 1, j = n; i < j; i++, j--) {
            int tmp = a[i];
            a[i] = a[j];
            a[j] = tmp;
        }
        while (m-- > 0) {
            int v = sc.nextInt(), x = sc.nextInt();
            int l = 0, r = n;
            while (l < r) {
                int mid = l + r + 1 >> 1;
                if (x <= a[mid]) l = mid;
                else r = mid - 1;
            }
            out.println(l >= v ? "YES" : "NO");
        }
        out.flush();
    }
}


class FastReader {
    StringTokenizer st;
    BufferedReader br;

    FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    int nextInt() {
        return Integer.parseInt(next());
    }

    String nextLine() {
        String s = "";
        try {
            s = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return s;
    }

    long nextLong() {
        return Long.parseLong(next());
    }

    double nextDouble() {
        return Double.parseDouble(next());
    }

    // 是否由下一个
    boolean hasNext() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                String line = br.readLine();
                if (line == null)
                    return false;
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return true;
    }
}

